翻訳と辞書 |
Chudnovsky algorithm : ウィキペディア英語版 | Chudnovsky algorithm The Chudnovsky algorithm is a fast method for calculating the digits of π. It was published by the Chudnovsky brothers in 1989,〔.〕 and was used in the world record calculations of 2.7 trillion digits of π in December 2009,〔.〕 5 trillion digits of π in August 2010,〔.〕 10 trillion digits of π in October 2011, and 12.1 trillion digits in December 2013. The algorithm is based on the negated Heegner number , the j-function , and on the following rapidly convergent generalized hypergeometric series:〔 : This identity is similar to some of Ramanujan's formulas involving π,〔 and is an example of a Ramanujan–Sato series. ==See also==
*Numerical approximations of π *Ramanujan–Sato series
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Chudnovsky algorithm」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|